Stable Closures, Defeasible Logic and Contradiction Tolerant Reasoning
نویسنده
چکیده
A solution to the Yale shooting problem has been previously proposed that uses so-called non-normal defaults. This approach produces a single extension. One disadvantage, however, is . that new conflicting information causes the extension to collapse. In this paper we propose a new formal counterpart to the intuitive notion of a reasonable set of beliefs. The new formalization reduces to the previous one when there are no conflicts. However, when fresh conflicting information is added, instead of collapsing it produces a revised interpretation similar to that obtained by dependency-directed backtracking in a truth maintenance system. Consideration of the relationship to relevance logic motivates the development of a new formalism for default reasoning, called Defeasible Logic, which behaves like Autoepistemic Logic, but may be more intuitive.
منابع مشابه
Reasoning in the presence of inconsistency through Preferential ALC
This paper presents an inconsistency tolerant semantics for the Description Logic ALC called Preferential ALC (p-ALC ). A p-ALC knowledge base is comprised of defeasible and non-defeasible axioms. The defeasible ABox and TBox are labelled with confidence weights that could reflect an axiom’s provenance. Entailment is defined through the notion of preferred interpretations which minimise the tot...
متن کاملLogic Programming for Non-Monotonic Reasoning
Our purpose is to exhibit a modular systematic method of representing nonmonotonic reasoning problems with the Well Founded Semantics of extended logic programs aumented with eXplicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We show how to cast in the language of such logic programs forms of non-monotonic reasoning like defeasible reasoning and hypot...
متن کاملEmbedding defeasible logic into logic programming
Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper ...
متن کاملNon-Monotonic Reasoning with Logic Programming
Our purpose is to exhibit a modular systematic method of representing non{ monotonic reasoning problems with the Well Founded Semantics WFS of extended logic programs augmented with eXplicit negation (WFSX), augmented by its Contradiction Removal Semantics (CRSX) when needed. We apply this semantics, and its contradiction removal semantics counterpart, to represent non-monotonic reasoning probl...
متن کاملEmbedding Defeasible Logic into Logic Programs
(c) If D is decisive then the implications (a) and (b) are also true in the opposite direction. That is, if D is decisive, then the stable model semantics of P(D) corresponds to the provability in defeasible logic. However part (c) is not true in the general case, as the following example shows. Example 5. Consider the defeasible theory r 1 :) :p r 2 : p) p In defeasible logic, +@:p cannot be p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988